Replacing iterative algorithms with single-pass algorithms
نویسندگان
چکیده
منابع مشابه
Notes on Single-Pass Online Learning Algorithms
Online learning methods are typically faster and have a much smaller memory footprint than batch learning methods. However, in practice online learners frequently require multiple passes over the same training data in order to achieve accuracy comparable to batch learners. We investigate the problem of single-pass online learning, i.e., training only on a single pass over the data. We compare t...
متن کاملFast, single-pass K-means algorithms
We discuss the issue of how well K-means scales to large databases. We evaluate the performance of our implementation of a scalable variant of K-means, from Bradley, Fayyad and Reina (1998b), that uses several, fairly complicated, types of compression to t points into a xed size buuer, which is then used for the clustering. The running time of the algorithm and the quality of the resulting clus...
متن کاملImplementing Iterative Algorithms with SPARQL
The SPARQL declarative query language includes innovative capabilities to match subgraph patterns within a semantic graph database, providing a powerful base upon which to implement complex graph algorithms for very large data. Iterative algorithms are useful in a wide variety of domains, in particular in the data-mining and machine-learning domains relevant to graph analytics. In this paper we...
متن کاملImproved Single Pass Algorithms for Resolution Proof Reduction - (Poster Presentation)
An unsatisfiability proof is a series of applications of proof rules on an input formula to deduce false. Unsatisfiability proofs for a Boolean formula can find many applications in verification. For instance, one application is automatic learning of abstractions for unbounded model checking by analyzing proofs of program safety for bounded steps [6, 5, 4]. We can also learn unsatisfiable cores...
متن کاملImproved Single Pass Algorithms for Resolution Proof Reduction
Unsatisfiability proofs find many applications in verification. Today, many SAT solvers are capable of producing resolution proofs of unsatisfiability. For efficiency smaller proofs are preferred over bigger ones. The solvers apply proof reduction methods to remove redundant parts of the proofs while and after generating the proofs. One method of reducing resolution proofs is redundant resoluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2001
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.191387398